MIX is a 2-MCFL and the word problem in Z is solved by a third-order collapsible pushdown automaton

نویسنده

  • Sylvain Salvati
چکیده

In this work we establish that the language MIX = {w ∈ {a; b; c}||w|a = |w|b = |w|c} and the language O2 = {w ∈ {a; a; b; b}||w|a = |w|a ∧ |w|b = |w|b} are 2-MCFLs. As 2-MCFLs form a class of languages that is included in both the IO and OI hierarchies, and as O2 is the group language of a simple presentation of Z we exhibit here the first, to our knowledge, non-virtually-free group language (i.e. non-context-free group language) that is captured by the IO and OI hierarchies. Moreover, it was a long-standing open problem whether MIX was a mildly context sensitive language or not, and it was conjectured that it was not, so we close this conjecture by giving it a negative answer.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Global Model Checking Trees Generated by Higher-Order Recursion Schemes

Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking Problem takes as input such a recursion scheme together with a modal μ-calculus sentence and asks for a finite representation of the set of nodes in the tree generated by the scheme at which the sentence holds. Using a...

متن کامل

First-Order Logic on CPDA Graphs

We contribute to the question about decidability of firstorder logic on configuration graphs of collapsible pushdown automata. Our first result is decidability of existential FO sentences on configuration graphs (and their ε-closures) of collapsible pushdown automata of order 3, restricted to reachable configurations. Our second result is undecidability of whole first-order logic on configurati...

متن کامل

A Saturation Method for Collapsible Pushdown Systems

We introduce a natural extension of collapsible pushdown systems called annotated pushdown systems that replaces collapse links with stack annotations. We believe this new model has many advantages. We present a saturation method for global backwards reachability analysis of these models that can also be used to analyse collapsible pushdown systems. Beginning with an automaton representing a se...

متن کامل

First-Order Model Checking on Generalisations of Pushdown Graphs

We study the first-order model checking problem on two generalisations of pushdown graphs. The first class is the class of nested pushdown trees. The other is the class of collapsible pushdown graphs. Our main results are the following. First-order logic with reachability is uniformly decidable on nested pushdown trees. Considering first-order logic without reachability, we prove decidability i...

متن کامل

Strictness of the Collapsible Pushdown Hierarchy

We present a pumping lemma for each level of the collapsible pushdown graph hierarchy in analogy to the second author’s pumping lemma for higher-order pushdown graphs (without collapse). Using this lemma, we give the first known examples that separate the levels of the collapsible pushdown graph hierarchy and of the collapsible pushdown tree hierarchy, i.e., the hierarchy of trees generated by ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011